skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

Explore Research Products in the PAR
It may take a few hours for recently added research products to appear in PAR search results.


  • Home
  • Search Results
  • Page 1 of 1

Search for: All records

Editors contains: "Georgiou, Konstantinos"

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. ; ; ; (, Canadian Conference on Computational Geometry)
    Bahoo, Yeganeh; Georgiou, Konstantinos (Ed.)
    Accepted Manuscript Full Text Available
  2. ; ; ; (, The Canadian Conference on Computational Geometry)
    Bahoo, Yeganeh; Georgiou, Konstantinos (Ed.)
    In this work we consider the Steiner tree problem under Bilu-Linial stability. We give strong geometric struc- tural properties that need to be satisfied by stable in- stances. We then make use of, and strengthen, these geometric properties to show that 1.59-stable instances of Euclidean Steiner trees are polynomial-time solvable by showing it reduces to the minimum spanning tree problem. We also provide a connection between certain approximation algorithms and Bilu-Linial stability for Steiner trees. 
    more » « less
    Accepted Manuscript Full Text Available
  3. (, Canadian Conference in Computational Geometry)
    Bahoo, Yeganeh; Georgiou, Konstantinos (Ed.)
    We investigate the maximum subbarcode matching problem which arises from the study of persistent homology and introduce the subbarcode distance on barcodes. A barcode is a set of intervals which correspond to topological features in data and is the output of a persistent homology computation. A barcode A has a subbarcode matching to B if each interval in A matches to an interval in B which contains it. We present an algorithm which takes two barcodes, A and B, and returns a maximum subbarcode matching. 
    more » « less
    Accepted Manuscript Full Text Available